Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
321	Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:35:59 NP-complete problems Combinatorial optimization Dynamic programming Mathematical optimization Operations research Optimal control Connectivity Tree decomposition Parameterized complexity Theoretical computer science Graph theory Mathematics
322	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory
323	Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:04 Applied mathematics NP-complete problems Dominating set Random graph Connectivity Graph Theoretical computer science Mathematics Graph theory
324	ICS 161 — Algorithms — Spring 2005 — Second Midterm Please answer the following seven questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to wri Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-05-26 20:09:03 Operations research Graph theory Mathematical optimization NP-complete problems Network theory Algorithm Shortest path problem Dynamic programming Graph Theoretical computer science Mathematics Applied mathematics
325	On Rolling Cube Puzzles Kevin Buchin∗ Martin L. Demaine† Christian Knauer∗ Maike Buchin∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:52 NP-complete problems Hamiltonian path Icosahedron Combination puzzles Puzzles Line graph N-dimensional sequential move puzzle Graph theory Theoretical computer science Mathematics
326	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
327	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
328	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
329	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Zipper Unfolding of Domes and Prismoids Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 NP-complete problems Planar graphs Hamiltonian path Polyhedron Dodecahedron Graph theory Theoretical computer science Mathematics
330	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:20 Planar graphs Graph Unit disk graph Planar straight-line graph P Geographic routing Graph theory Theoretical computer science NP-complete problems

UPDATE